Doing the twist: diagonal meshes are isomorphic to twisted toroidal meshes
نویسندگان
چکیده
منابع مشابه
Doing the Twist: Diagonal Meshes Are Isomorphic to Twisted Toroidal Meshes
We show that a k x n diagonal mesh is isomorphic to a 9 x 9 -9 x 9 twisted toroidal mesh, i.e., a network similar to a standard 9 x 9 toroidal mesh, but with opposite handed twists of 9 in the two directions, which results in a loss of (9)2 nodes
متن کاملMulticolored Dynamos on Toroidal Meshes
Detecting on a graph the presence of the minimum number of nodes (target set) that will be able to “activate” a prescribed number of vertices in the graph is called the target set selection problem (TSS) proposed by Kempe, Kleinberg, and Tardos. In TSS’s settings, nodes have two possible states (active or non-active) and the threshold triggering the activation of a node is given by the number o...
متن کاملGlobal Communication on Circuit-Switched Toroidal Meshes
In this paper, we investigate the uses of virtual channels and multiple communication ports to improve the performance of global communication algorithms for cycles and multi-dimensional toroidal meshes. We use a linear cost model to compare the performances of the best single-port algorithms for broadcasting, scattering, gossiping, and multi-scattering with algorithms that can use multiple por...
متن کاملTotal and paired domination numbers of toroidal meshes
Let G be a graph without isolated vertices. The total domination number of G is the minimum number of vertices that can dominate all vertices in G, and the paired domination number of G is the minimum number of vertices in a dominating set whose induced subgraph contains a perfect matching. This paper determines the total domination number and the paired domination number of the toroidal meshes...
متن کاملSelf-Timed Meshes Are Faster Than Synchronous
This paper shows that self-timed meshes can achieve linear speed-up. The per-processor performance of a mesh is the average number of operations per processor per unit time. For synchronous processors, it has been shown that the per-processor performance of a mesh goes to zero as the size of the mesh goes to infinity. This paper shows that for self-timed meshes, the per-processor performance ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 1996
ISSN: 0018-9340
DOI: 10.1109/12.506434